Polar Bear Optimization Algorithm: Meta-Heuristic with Fast Population Movement and Dynamic Birth and Death Mechanism
نویسندگان
چکیده
In the proposed article, we present a nature-inspired optimization algorithm, which we called Polar Bear Optimization Algorithm (PBO). The inspiration to develop the algorithm comes from the way polar bears hunt to survive in harsh arctic conditions. These carnivorous mammals are active all year round. Frosty climate, unfavorable to other animals, has made polar bears adapt to the specific mode of exploration and hunting in large areas, not only over ice but also water. The proposed novel mathematical model of the way polar bears move in the search for food and hunt can be a valuable method of optimization for various theoretical and practical problems. Optimization is very similar to nature, similarly to search for optimal solutions for mathematical models animals search for optimal conditions to develop in their natural environments. In this method. we have used a model of polar bear behaviors as a search engine for optimal solutions. Proposed simulated adaptation to harsh winter conditions is an advantage for local and global search, while birth and death mechanism controls the population. Proposed PBO was evaluated and compared to other meta-heuristic algorithms using sample test functions and some classical engineering problems. Experimental research results were compared to other algorithms and analyzed using various parameters. The analysis allowed us to identify the leading advantages which are rapid recognition of the area by the relevant population and efficient birth and death mechanism to improve global and local search within the solution space.
منابع مشابه
Introducing a new meta-heuristic algorithm based on See-See Partridge Chicks Optimization to solve dynamic optimization problems
The SSPCO (See-See Particle Chicks Optimization) is a type of swarm intelligence algorithm derived from the behavior of See-See Partridge. Although efficiency of this algorithm has been proven for solving static optimization problems, it has not yet been tested to solve dynamic optimization problems. Due to the nature of NP-Hard dynamic problems, this algorithm alone is not able to solve such o...
متن کاملOptimizing the warranty period by cuckoo meta-heuristic algorithm in heterogeneous customers’ population
Warranty is now an integral part of each product. Since its length is directly related to the cost of production, it should be set in such a way that it would maximize revenue generation and customers’ satisfaction. Furthermore, based on the behavior of customers, it is assumed that increasing the warranty period to earn the trust of more customers leads to more sales until the market is sat...
متن کاملSIZING OPTIMIZATION OF TRUSS STRUCTURES WITH NEWTON META-HEURISTIC ALGORITHM
This study is devoted to discrete sizing optimization of truss structures employing an efficient discrete evolutionary meta-heuristic algorithm which uses the Newton gradient-based method as its updating scheme and it is named here as Newton Meta-heuristic Algorithm (NMA). In order to enable the NMA population-based meta-heuristic to effectively explore the discrete design space, a term contain...
متن کاملClustering and Memory-based Parent-Child Swarm Meta-heuristic Algorithm for Dynamic Optimization
So far, various optimization methods have been proposed, and swarm intelligence algorithms have gathered a lot of attention by academia. However, most of the recent optimization problems in the real world have a dynamic nature. Thus, an optimization algorithm is required to solve the problems in dynamic environments well. In this paper, a novel collective optimization algorithm, namely the Clus...
متن کاملTesting Soccer League Competition Algorithm in Comparison with Ten Popular Meta-heuristic Algorithms for Sizing Optimization of Truss Structures
Recently, many meta-heuristic algorithms are proposed for optimization of various problems. Some of them originally are presented for continuous optimization problems and some others are just applicable for discrete ones. In the literature, sizing optimization of truss structures is one of the discrete optimization problems which is solved by many meta-heuristic algorithms. In this paper, in or...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Symmetry
دوره 9 شماره
صفحات -
تاریخ انتشار 2017